/*
   @Copyright:LeetCode
   @Author:   tjyemail
   @Problem:  http://leetcode.com/problems/search-insert-position
   @Language: C++
   @Datetime: 19-06-04 17:54
   */

class Solution {
public:
	int searchInsert(vector<int>& nums, int target) {
		return lower_bound(nums.begin(),nums.end(),target)-nums.begin();
	}
};
